Inertia of the matrix $[(p_i+p_j)^r]$

Inertia of the Matrix

Let p1, . . . , pn be positive real numbers. It is well known that for every r < 0 the matrix [(pi + pj) r ] is positive definite. Our main theorem gives a count of the number of positive and negative eigenvalues of this matrix when r > 0. Connections with some other matrices that arise in Loewner’s theory of operator monotone functions and in the theory of spline interpolation are discussed.

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

A decomposition of the manipulator inertia matrix

Refined Inertia of Matrix Patterns

This paper explores how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. It demonstrates that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike what happens for nonzero patterns. A class of patterns is developed that are refined inertially arbitrary but not spectrally arbitrary, making use o...

Efficient formulations for the manipulator inertia matrix in terms of minimal linear combinations of inertia parameters

This article summarizes four formulations of the composite body method for the inertia matrix of a manipulator in the earlier works and presents a new formulation. These five formulations all use the first moments and the inertia tensors of composite bodies about the origin of the local frame. This paper also presents an algorithm for computing these first moments and inertia tensors. This algo...